TSTP Solution File: CSR134^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR134^2 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:34:36 EDT 2024
% Result : Theorem 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 29 ( 5 unt; 7 typ; 0 def)
% Number of atoms : 66 ( 0 equ; 0 cnn)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 228 ( 34 ~; 27 |; 13 &; 154 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 19 ( 19 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 20 ( 0 ^ 14 !; 6 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_28,type,
holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
thf(decl_33,type,
lAnna_THFTYPE_i: $i ).
thf(decl_39,type,
lBob_THFTYPE_i: $i ).
thf(decl_46,type,
lSue_THFTYPE_i: $i ).
thf(decl_53,type,
lYearFn_THFTYPE_IiiI: $i > $i ).
thf(decl_58,type,
n2009_THFTYPE_i: $i ).
thf(decl_60,type,
parent_THFTYPE_IiioI: $i > $i > $o ).
thf(ax_019,axiom,
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i ) ),
file('/export/starexec/sandbox/tmp/tmp.PcCvG5koXY/E---3.1_23417.p',ax_019) ).
thf(con,conjecture,
? [X36: $i > $i > $o,X1: $i,X2: $i] :
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ( ( X36 @ X1 @ lAnna_THFTYPE_i )
& ~ ( X36 @ X2 @ lAnna_THFTYPE_i ) ) ),
file('/export/starexec/sandbox/tmp/tmp.PcCvG5koXY/E---3.1_23417.p',con) ).
thf(ax_009,axiom,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i ),
file('/export/starexec/sandbox/tmp/tmp.PcCvG5koXY/E---3.1_23417.p',ax_009) ).
thf(c_0_3,plain,
( ( ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[ax_019])]) ).
thf(c_0_4,negated_conjecture,
~ ? [X36: $i > $i > $o,X1: $i,X2: $i] :
( ( ~ ( ( X36 @ X1 @ lAnna_THFTYPE_i )
& ~ ( X36 @ X2 @ lAnna_THFTYPE_i ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( ( X36 @ X1 @ lAnna_THFTYPE_i )
& ~ ( X36 @ X2 @ lAnna_THFTYPE_i ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).
thf(c_0_5,plain,
( ( ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
! [X42: $i > $i > $o,X43: $i,X44: $i] :
( ( ~ ( X42 @ X43 @ lAnna_THFTYPE_i )
| ( X42 @ X44 @ lAnna_THFTYPE_i )
| ( X42 @ X43 @ lAnna_THFTYPE_i ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ( X42 @ X43 @ lAnna_THFTYPE_i ) )
& ( ~ ( X42 @ X43 @ lAnna_THFTYPE_i )
| ( X42 @ X44 @ lAnna_THFTYPE_i )
| ~ ( X42 @ X44 @ lAnna_THFTYPE_i ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ~ ( X42 @ X44 @ lAnna_THFTYPE_i ) )
& ( ~ ( X42 @ X43 @ lAnna_THFTYPE_i )
| ( X42 @ X44 @ lAnna_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
thf(c_0_7,plain,
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
| ~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
! [X36: $i > $i > $o,X1: $i] :
( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
| ~ ( X36 @ X1 @ lAnna_THFTYPE_i ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,axiom,
( ( ~ ( parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[ax_009]) ).
thf(c_0_10,plain,
( ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_11,plain,
~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i ),
inference(csr,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_12,plain,
( ( ~ ( parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_9]) ).
thf(c_0_13,negated_conjecture,
! [X36: $i > $i > $o,X1: $i] :
( ( X36 @ X1 @ lAnna_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_14,negated_conjecture,
! [X36: $i > $i > $o,X2: $i,X1: $i] :
( ( X36 @ X2 @ lAnna_THFTYPE_i )
| ~ ( X36 @ X1 @ lAnna_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_15,plain,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true,
inference(sr,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_16,plain,
( ( parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_17,negated_conjecture,
~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ),
inference(csr,[status(thm)],[c_0_13,c_0_8]) ).
thf(c_0_18,negated_conjecture,
! [X1: $i,X36: $i > $i > $o,X2: $i] :
( ( X36 @ X1 @ lAnna_THFTYPE_i )
| ~ ( X36 @ X2 @ lAnna_THFTYPE_i ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]) ).
thf(c_0_19,plain,
parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i,
inference(sr,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_20,negated_conjecture,
! [X1: $i] : ( parent_THFTYPE_IiioI @ X1 @ lAnna_THFTYPE_i ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
thf(c_0_21,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : CSR134^2 : TPTP v8.1.2. Released v4.1.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n004.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 15:16:08 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.49 Running higher-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.PcCvG5koXY/E---3.1_23417.p
% 0.21/0.51 # Version: 3.1.0-ho
% 0.21/0.51 # Preprocessing class: HSLSSMSMSSSNSSA.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting new_ho_10_unif with 1500s (5) cores
% 0.21/0.51 # Starting sh3l with 300s (1) cores
% 0.21/0.51 # Starting new_ho_6 with 300s (1) cores
% 0.21/0.51 # Starting lpo6_lambda_fix with 300s (1) cores
% 0.21/0.51 # sh3l with pid 23497 completed with status 0
% 0.21/0.51 # Result found by sh3l
% 0.21/0.51 # Preprocessing class: HSLSSMSMSSSNSSA.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting new_ho_10_unif with 1500s (5) cores
% 0.21/0.51 # Starting sh3l with 300s (1) cores
% 0.21/0.51 # SinE strategy is gf120_gu_RUU_F100_L01000
% 0.21/0.51 # Search class: HGHNF-FFMM11-SSSFFFBN
% 0.21/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.51 # new_ho_10 with pid 23500 completed with status 0
% 0.21/0.51 # Result found by new_ho_10
% 0.21/0.51 # Preprocessing class: HSLSSMSMSSSNSSA.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting new_ho_10_unif with 1500s (5) cores
% 0.21/0.51 # Starting sh3l with 300s (1) cores
% 0.21/0.51 # SinE strategy is gf120_gu_RUU_F100_L01000
% 0.21/0.51 # Search class: HGHNF-FFMM11-SSSFFFBN
% 0.21/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.51 # Preprocessing time : 0.002 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Theorem
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 128
% 0.21/0.51 # Removed by relevancy pruning/SinE : 106
% 0.21/0.51 # Initial clauses : 50
% 0.21/0.51 # Removed in clause preprocessing : 3
% 0.21/0.51 # Initial clauses in saturation : 47
% 0.21/0.51 # Processed clauses : 67
% 0.21/0.51 # ...of these trivial : 17
% 0.21/0.51 # ...subsumed : 11
% 0.21/0.51 # ...remaining for further processing : 39
% 0.21/0.51 # Other redundant clauses eliminated : 0
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 4
% 0.21/0.51 # Backward-rewritten : 4
% 0.21/0.51 # Generated clauses : 8
% 0.21/0.51 # ...of the previous two non-redundant : 7
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 2
% 0.21/0.51 # Paramodulations : 3
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 0
% 0.21/0.51 # Disequality decompositions : 0
% 0.21/0.51 # Total rewrite steps : 20
% 0.21/0.51 # ...of those cached : 12
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 12
% 0.21/0.51 # Positive orientable unit clauses : 7
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 3
% 0.21/0.51 # Non-unit-clauses : 2
% 0.21/0.51 # Current number of unprocessed clauses: 1
% 0.21/0.51 # ...number of literals in the above : 1
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 27
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 22
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 22
% 0.21/0.51 # Non-unit clause-clause subsumptions : 14
% 0.21/0.51 # Unit Clause-clause subsumption calls : 6
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 4
% 0.21/0.51 # BW rewrite match successes : 4
% 0.21/0.51 # Condensation attempts : 69
% 0.21/0.51 # Condensation successes : 1
% 0.21/0.51 # Termbank termtop insertions : 3436
% 0.21/0.51 # Search garbage collected termcells : 488
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.007 s
% 0.21/0.51 # System time : 0.001 s
% 0.21/0.51 # Total time : 0.009 s
% 0.21/0.51 # Maximum resident set size: 1912 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.011 s
% 0.21/0.51 # System time : 0.003 s
% 0.21/0.51 # Total time : 0.014 s
% 0.21/0.51 # Maximum resident set size: 1828 pages
% 0.21/0.51 % E---3.1 exiting
% 0.21/0.51 % E exiting
%------------------------------------------------------------------------------